package Demo02;

import hashbuck.HashBuck;

public class HashBuck2<K,V> {
    static class Node<K,V> {
        public K key;
        public V val;
        public Node<K,V> next;
        public Node(K key, V val) {
            this.key = key;
            this.val = val;
        }
    }

    public Node<K,V>[] array;
    public int usedSize;
    public static final float DEFAULT_LOAD_FACTOR = 0.75f;

    public HashBuck2() {
        array = (Node<K,V>[])new Node[10];
    }
    public void put(K key, V val){
        int hash = key.hashCode();
        int index = hash% array.length;
        Node<K,V> cur = array[index];
        //查看之前是否存在key值,存在的话,更新val,不存在,进行头插法
        while (cur!=null) {
            if(cur.key==key) {
                cur.val = val;
                return;
            }
            cur = cur.next;
        }
        //不存在key值进行头插法
        Node<K,V> newNode = new Node(key,val);
        newNode.next = array[index];
        array[index] = newNode;
        usedSize++;
    }

    public V get(K key) {
        int hash = key.hashCode();
        int index = hash% array.length;
        Node<K,V> cur = array[index];
        //查看之前是否存在key值,存在的话,更新val,不存在,进行头插法
        while (cur!=null) {
            if(cur.key.equals(key)) {
                return cur.val;
            }
            cur = cur.next;
        }
        return null;
    }
}
